Representation of finitely generated nilpotent groups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isoperimetric Functions of Finitely Generated Nilpotent Groups

We show that the isoperimetric function of a nitely generated nilpotent group of class c is bounded above by a polynomial of degree 2c.

متن کامل

Dominions in finitely generated nilpotent groups

In the first part, we prove that the dominion (in the sense of Isbell) of a subgroup of a finitely generated nilpotent group is trivial in the category of all nilpotent groups. In the second part, we show that the dominion of a subgroup of a finitely generated nilpotent group of class two is trivial in the category of all metabelian nilpotent groups. Section

متن کامل

Finitely generated nilpotent groups are finitely presented and residually finite

Definition 1. Let G be a group. G is said to be residually finite if the intersection of all normal subgroups of G of finite index in G is trivial. For a survey of results on residual finiteness and related properties, see Mag-nus, Karrass, and Solitar [6, Section 6.5]. We shall present a proof of the following well known theorem, which is important for Kharlampovich [4, 5]. See also O. V. Bele...

متن کامل

Division Algebras Generated by Finitely Generated Nilpotent Groups

Division algebras D generated by some finitely generated nilpotent subgroup G of the multiplicative group D* of D are studied and the question to what extent G is determined by D is considered. Trivial examples show that D does not determine G up to isomorphism. However, it is proved that if F denotes the center of D, then the F-subalgebra of D generated by G is in fact determined up to isomorp...

متن کامل

Model theoretic connected components of finitely generated nilpotent groups

We prove that for a finitely generated infinite nilpotent group G with a first order structure (G, ·, . . .), the connected component G of a sufficiently saturated extension G of G exists and equals ⋂ n∈N {g : g ∈ G}. We construct a first order expansion of Z by a predicate (Z,+, P ) such that the type-connected component Z ∅ is strictly smaller than Z. We generalize this to finitely generated ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1973

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1973.45.13